Multivariate Cointegration and Temporal Aggregation: Some Further Simulation Results

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some Results on Convexity and Concavity of Multivariate Copulas

This paper provides some results on different types of convexity and concavity in the class of multivariate copulas. We also study their properties and provide several examples to illustrate our results.

متن کامل

Further results on odd mean labeling of some subdivision graphs

Let G(V,E) be a graph with p vertices and q edges. A graph G is said to have an odd mean labeling if there exists a function f : V (G) → {0, 1, 2,...,2q - 1} satisfying f is 1 - 1 and the induced map f* : E(G) → {1, 3, 5,...,2q - 1} defined by f*(uv) = (f(u) + f(v))/2 if f(u) + f(v) is evenf*(uv) = (f(u) + f(v) + 1)/2 if f(u) + f(v) is odd is a bijection. A graph that admits an odd mean labelin...

متن کامل

Some Results in Multivariate Interpolation

The aim of this paper is to introduce and analyze a multivariate interpolation scheme of Hermite-Birkhoff type. We found the interpolation space, the interpolation operator and its dual operator. 2000 Mathematics Subject Classification: 65D32

متن کامل

Some Simulation Results for Emphatic Temporal-Difference Learning Algorithms

This is a companion note to our recent study of the weak convergence properties of constrained emphatic temporal-difference learning (ETD) algorithms from a theoretic perspective. It supplements the latter analysis with simulation results and illustrates the behavior of some of the ETD algorithms using three example problems.

متن کامل

On Some Tighter Inapproximability Results, Further Improvements

Improved inaproximability results are given, including the best up to date explicit approximation thresholds for bounded occurence sat-issability problems, like MAX-2SAT and E2-LIN-2, and problems in bounded degree graphs, like MIS, Node Cover and MAX CUT. We prove also for the rst time inapproximability of the problem of Sorting by Reversals and display an explicit approximation threshold for ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computational Economics

سال: 2020

ISSN: 0927-7099,1572-9974

DOI: 10.1007/s10614-020-10062-w